Overlapping Schwarz Methods for Fekete and Gauss-Lobatto Spectral Elements
نویسندگان
چکیده
The classical overlapping Schwarz algorithm is here extended to the triangular/tetrahedral spectral element (TSEM) discretization of elliptic problems. This discretization, based on Fekete nodes, is a generalization to nontensorial elements of the tensorial Gauss–Lobatto–Legendre quadrilateral spectral elements (QSEM). The overlapping Schwarz preconditioners are based on partitioning the domain of the problem into overlapping subdomains, solving local problems on these subdomains, and solving an additional coarse problem associated with either the subdomain mesh or the spectral element mesh. The overlap size is generous, i.e., one element wide, in the TSEM case, while it is minimal or variable in the QSEM case. The results of several numerical experiments show that the convergence rate of the proposed preconditioning algorithm is independent of the number of subdomains N and the spectral degree p in case of generous overlap; otherwise it depends inversely on the overlap size. The proposed preconditioners are also robust with respect to arbitrary jumps of the coefficients of the elliptic operator across subdomains.
منابع مشابه
Tensor product Gauss-Lobatto points are Fekete points for the cube
Tensor products of Gauss-Lobatto quadrature points are frequently used as collocation points in spectral element methods. Unfortunately, it is not known if Gauss-Lobatto points exist in non-tensor-product domains like the simplex. In this work, we show that the n-dimensional tensor-product of Gauss-Lobatto quadrature points are also Fekete points. This suggests a way to generalize spectral meth...
متن کاملAn Algorithm for Computing Fekete Points in the Triangle
On the line and its tensor products, Fekete points are known to be the Gauss–Lobatto quadrature points. But unlike high-order quadrature, Fekete points generalize to non-tensor-product domains such as the triangle. Thus Fekete points might serve as an alternative to the Gauss–Lobatto points for certain applications. In this work we present a new algorithm to compute Fekete points and give resul...
متن کاملp-Multigrid for Fekete spectral element method
Spectral element approximations based on triangular elements and on the so-called Fekete points of the triangle have been recently developed. p-multigrid methods offer an interesting way to resolve efficiently the resulting ill-conditioned algebraic systems. For elliptic problems, it is shown that a well chosen restriction operator and a good set up of the coarse grid matrices may lead to valua...
متن کاملPseudo-spectral Matrix and Normalized Grunwald Approximation for Numerical Solution of Time Fractional Fokker-Planck Equation
This paper presents a new numerical method to solve time fractional Fokker-Planck equation. The space dimension is discretized to the Gauss-Lobatto points, then we apply pseudo-spectral successive integration matrix for this dimension. This approach shows that with less number of points, we can approximate the solution with more accuracy. The numerical results of the examples are displayed.
متن کاملComputing Fekete and Lebesgue points: Simplex, square, disk
The main purpose of our work is to provide Fekete and Lebesgue points on three basic bidimensional compact sets, the simplex, the square, and the disk, by solving numerically the corresponding large-scale nonlinear optimization problems up to degree n = 18. Our results reach and often improve those previously known [1], [3]. In the case of the simplex, due to their relevance in developing spect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 29 شماره
صفحات -
تاریخ انتشار 2007